Theorem proving using computational systems : The case of the
نویسندگان
چکیده
The framework of computational systems has been already used for describing several computational logics. In this paper is described the way a propositional prover and a predicate prover are implemented in ELAN, the system developed in Nancy for describing and executing computational systems. The inference rules for the provers are described by conditional rewrite rules and their application is controlled by strategies. We show how diierent strategies using the same set of rewrite rules can yield diierent results. Some implementation issues are discussed and we provide a proof of termination of the propositional prover using rewrite techniques.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملModeling of Infinite Divisible Distributions Using Invariant and Equivariant Functions
Basu’s theorem is one of the most elegant results of classical statistics. Succinctly put, the theorem says: if T is a complete sufficient statistic for a family of probability measures, and V is an ancillary statistic, then T and V are independent. A very novel application of Basu’s theorem appears recently in proving the infinite divisibility of certain statistics. In addition ...
متن کاملA fixed point method for proving the stability of ring $(alpha, beta, gamma)$-derivations in $2$-Banach algebras
In this paper, we first present the new concept of $2$-normed algebra. We investigate the structure of this algebra and give some examples. Then we apply a fixed point theorem to prove the stability and hyperstability of $(alpha, beta, gamma)$-derivations in $2$-Banach algebras.
متن کاملWhatever Happened to Deductive Question Answering?
Deductive question answering, the extraction of answers to questions from machine-discovered proofs, is the poor cousin of program synthesis. It involves much of the same technology—theorem proving and answer extraction—but the bar is lower. Instead of constructing a general program to meet a given specification for any input—the program synthesis problem—we need only construct answers for spec...
متن کاملStabilization of Nonlinear Control Systems through Using Zobov’s Theorem and Neural Networks
Zobov’s Theorem is one of the theorems which indicate the conditions for the stability of a nonlinear system with specific attraction region. We have applied neural networks to approximate some functions mentioned in Zobov’s theorem in order to find the controller of a nonlinear controlled system whose law in a mathematical manner is difficult to make. Finally, the effectiveness and the applica...
متن کاملDistributed Theorem Proving for Distributed Hybrid Systems
Distributed hybrid systems present extraordinarily challenging problems for verification. On top of the notorious difficulties associated with distributed systems, they also exhibit continuous dynamics described by quantified differential equations. All serious proofs rely on decision procedures for real arithmetic, which can be extremely expensive. Quantified Differential Dynamic Logic (QdL) h...
متن کامل